Detecting Emergent Behaviors with Semi-Boolean Algebra
نویسندگان
چکیده
As aerospace and military systems become increasingly interconnected, their combined behavior can become more complex than each individual subsystem in isolation and unexpected self-organizing or emergent behaviors can result. Explicit consideration of emergent behavior has not been addressed in current systems development methodologies. This paper gives background on approaches for modeling emergent behavior and discusses the use of semi-Boolean algebra as a means for detecting emergence in combined behaviors. Semi-Boolean algebra is a generalization of the Boolean algebra by weakening the requirement that any two elements have a common upper bound. The paper also shares an example approach for modeling emergent behavior and describes several ways to detect emergent behavior with this technique.
منابع مشابه
Dually quasi-De Morgan Stone semi-Heyting algebras II. Regularity
This paper is the second of a two part series. In this Part, we prove, using the description of simples obtained in Part I, that the variety $mathbf{RDQDStSH_1}$ of regular dually quasi-De Morgan Stone semi-Heyting algebras of level 1 is the join of the variety generated by the twenty 3-element $mathbf{RDQDStSH_1}$-chains and the variety of dually quasi-De Morgan Boolean semi-Heyting algebras--...
متن کاملDually quasi-De Morgan Stone semi-Heyting algebras I. Regularity
This paper is the first of a two part series. In this paper, we first prove that the variety of dually quasi-De Morgan Stone semi-Heyting algebras of level 1 satisfies the strongly blended $lor$-De Morgan law introduced in cite{Sa12}. Then, using this result and the results of cite{Sa12}, we prove our main result which gives an explicit description of simple algebras(=subdirectly irreducibles) ...
متن کاملSemi-G-filters, Stonean filters, MTL-filters, divisible filters, BL-filters and regular filters in residuated lattices
At present, the filter theory of $BL$textit{-}algebras has been widelystudied, and some important results have been published (see for examplecite{4}, cite{5}, cite{xi}, cite{6}, cite{7}). In other works such ascite{BP}, cite{vii}, cite{xiii}, cite{xvi} a study of a filter theory inthe more general setting of residuated lattices is done, generalizing thatfor $BL$textit{-}algebras. Note that fil...
متن کاملOn Semi-boolean-like Algebras
In a previous paper, we introduced the notion of Boolean-like algebra as a generalisation of Boolean algebras to an arbitrary similarity type. In a nutshell, a double-pointed algebra A with constants 0, 1 is Booolean-like in case for all a ∈ A the congruences θ (a, 0) and θ (a, 1) are compementary factor congruences of A. We also introduced the weaker notion of semi-Boolean-like algebra, showin...
متن کاملSemi-Cohen Boolean Algebras
We investigate classes of Boolean algebras related to the notion of forcing that adds Cohen reals. A Cohen algebra is a Boolean algebra that is dense in the completion of a free Boolean algebra. We introduce and study generalizations of Cohen algebras: semi-Cohen algebras, pseudo-Cohen algebras and potentially Cohen algebras. These classes of Boolean algebras are closed under completion.
متن کامل